Maximum compatible classes from compatibility matrices

Comment on "The Determination of the Maximum Compatibility Classes"

Spatial Weights: Constructing Weight-Compatible Exchange Matrices from Proximity Matrices

Exchange matrices represent spatial weights as symmetric probability distributions on pairs of regions, whose margins yield regional weights, generally well-specified and known in most contexts. This contribution proposes a mechanism for constructing exchange matrices, derived from quite general symmetric proximity matrices, in such a way that the margin of the exchange matrix coincides with th...

On Some Special Classes of Sonnenschein Matrices

‎In this paper we consider the special classes of Sonnenschein matrices‎, ‎namely the Karamata matrices $K[alpha,beta]=left(a_{n,k}right)$ with the entries‎ ‎[{a_{n,k}} = sumlimits_{v = 0}^k {left( begin{array}{l}‎ ‎n\‎ ‎v‎ ‎end{array} right){{left( {1‎ - ‎alpha‎ - ‎beta } right)}^v}{alpha ^{n‎ - ‎v}}left( begin{array}{l}‎ ‎n‎ + ‎k‎ - ‎v‎ - ‎1\‎ ‎,,,,,,,,,,k...

Maximum agreement and compatible supertrees

Given a collection of trees on leaves with identical leaf set, the MAST, resp. MCT, problem consists in finding a largest subset of the leaves such that all input trees restricted to this set are identical, resp. have a common refinement. For MAST, resp. MCT, on rooted trees, we give an algorithm, where and is the smallest number of leaves whose removal leads to the existence of an agreement su...

Classes of Elliptic Matrices